Introducing mobility into CSP‖B

CSP‖B is a combination of CSP and B which supports the design and verification of systems where control and state are both important. Recent work on combining the pi-calculus with B introduces mobility into the control of B machines and enables them to be passed around. This additional functionality is appropriate for modeling systems such as peer-to-peer networks. While the pi-calculus is appropriate for the description of mobility, the semantic foundation for pi |B is cumbersome for reasoning about systems, and a CSP based approach may be preferable. This paper considers how CSP can be extended to support mobile channels while retaining a trace-based semantics, within the context of CSP‖B. While this is difficult for CSP in general, the restricted context provided by CSP‖B does enable some progress to be made in this area. This is work in progress.